DEDUCTIVE SYSTEMS IN COMMUTATIVE PRE-LOGICS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Annihilators and deductive systems in commutative Hilbert algebras

The properties of deductive systems in Hilbert algebras are treated. If a Hilbert algebra H considered as an ordered set is an upper semilattice then prime deductive systems coincide with meet-irreducible elements of the lattice DedH of all deductive systems on H and every maximal deductive system is prime. Complements and relative complements of DedH are characterized as the so called annihila...

متن کامل

EQ-logics: Non-commutative fuzzy logics based on fuzzy equality

In this paper, we develop a specific formal logic in which the basic connective is fuzzy equality and the implication is derived from the latter. Moreover, the fusion connective (strong conjunction) is noncommutative. We call this logic EQ-logic. First, we formulate the basic EQ-logic which is rich enough to enjoy the completeness property. Furthermore, we introduce two extensions which seem to...

متن کامل

Non-Commutative EQ-Logics and Their Extensions

We discuss a formal many-valued logic called EQlogic which is based on a recently introduced special class of algebras called EQ-algebras. The latter have three basic binary operations (meet, multiplication, fuzzy equality) and a top element and, in a certain sense, generalize residuated lattices. The goal of EQ-logics is to present a possible direction in the development of mathematical logics...

متن کامل

Optimizing Query Answering in Description Logics using Disjunctive Deductive Databases

Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator μ that transforms non-recursive ALC ontologies into a disjunctive deductive database. Contrary to our previous work, in this paper we focus on handling negation, disjunction and existential quantifiers, which cannot be handled by deducti...

متن کامل

Reasoning in description logics using resolution and deductive databases

Description logics (DLs) are knowledge representation formalisms with well-understood model-theoretic semantics and computational properties. The DL SHIQ(D) provides the logical underpinning for the family of Semantic Web ontology languages. Metadata management applications, such as the Semantic Web, often require reasoning with large quantities of assertional information; however, existing alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Honam Mathematical Journal

سال: 2010

ISSN: 1225-293X

DOI: 10.5831/hmj.2010.32.4.625